Quantitative Analysis of Data ow Program Execution { Preliminaries to a

نویسندگان

  • Walid A. Najjar
  • Marcus Miller
چکیده

While the dataaow execution model can potentially uncover all forms and levels of parallelism in a program, in its traditional ne-grain form, it does not exploit any form of locality. Recent evidence indicates that the exploitation of locality in dataaow programs could have a dramatic impact on performance. The current trend in the design of dataaow processors suggest a synthesis of traditional non-strict ne grain instruction execution and a strict coarse grain execution in order to exploit locality. While an increase in instruction granularity will favor the exploitation of locality within a single execution thread, the resulting grain size may increase latency among execution threads. We deene ne grain intra-thread locality as a dynamic measure of instruction level locality and quantify it using a set of numeric and non-numeric benchmarks. The results point to a very large degree of intra-thread locality and a remarkable uniformity and consistency of the distribution of thread locality across a wide variety of benchmarks. We also evaluate the resulting latency incurred through the partitioning of ne grain instructions into coarser grain threads. We deene the concept of a cluster of ne grain instructions to quantify coarse grain input and output latencies. The results of our experiments ooer compelling evidence that the inner loops of a signiicant number of numeric codes would beneet from coarse grain execution. Based on cluster execution times, more than 60% of the measured benchmarks favor a coarse grain execution. In 63% of the cases the input latency to the cluster is the same in coarse or ne grain execution modes. These results suggest that the eeects of increased instruction granularity on latency is minimal for a high percentage of the measured codes, and in large part is ooset by available intra-thread locality. Furthermore, simulation results indicate that strict or non-strict data structure access does not change the basic cluster characteristics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Flow Analysis

Control and data ow information is vital for the optimization of high level programming languages. Language features such as object-orientation and rst class functions and selectors link data ow and control ow. For example, in an object-oriented program an object's run time type is used to determine the function (method) executed at an invocation point via dynamic dispatch. We present an iterat...

متن کامل

An integrated simulation-DEA approach to multi-criteria ranking of scenarios for execution of operations in a construction project

The purpose of this study is to examine different scenarios for implementing operations in the pre-construction phase of a project, based on several competing criteria with different importance levels in order to achieve a more efficient execution plan. This paper presents a new framework that integrates discrete event simulation (DES) and data envelopment analysis (DEA) to rank different scena...

متن کامل

Flow System with Two - Edge Pro ling yEduard

Traditionally optimization is done statically independent of actual execution environments. For generating highly optimized code, however, runtime information can be used to adapt a program to diierent environments. In probabilistic data ow systems run-time information on representative input data is exploited to compute the probability with what data ow facts may hold. Probabilistic data ow an...

متن کامل

Static Analysis for Guarded Code

Guarded(predicated) execution, as a new hardware feature, has been introduced into today's high performance processors. Guarded execution can signiicantly improve the performance of programs with conditional branches, and meanwhile also poses new challenges for conventional program analysis techniques. In this paper, we propose a static semantics inference mechanism to capture the semantics inf...

متن کامل

Implementation Tuning of a Data ow Language on AP1000 with Visualization Tools

In order to show the feasibility of a data ow language, we are implementing the language on non-data ow stock machines. Since our implementation is based on a ne-grain multithread execution model, it is di cult to statically analyze the program behavior. In order to understand the program behavior, visualization of the program execution is very e ective. We discuss our visualization tools for t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007